Permutation Statistics of Indexed Permutations
نویسنده
چکیده
The deenitions of descent, excedance, major index, inversion index and Denert's statistic for the elements of the symmetric group S d are generalized It is shown, bijectively, that excedances and descents are equidistributed, and the corresponding descent polynomial, analogous to the Eulerian polynomial , is computed as the f {eulerian polynomial of a simple polynomial. The descent polynomial is shown to equal the h{polynomial (essentially the h{vector) of a certain triangulation of the unit d{cube. This is proved by a bijection which exploits the fact that the h{vector of the simplicial complex arising from the triangulation can be computed via a shelling of the complex. The famous formula P d0 E d x d d! = sec x + tan x, where E d is the number of alternating permutations in S d , is generalized in two diierent ways, one relating to recent work of V.I. Arnold on Morse theory. The major index and inversion index are shown to be equidistributed over S n d. Likewise, the pair of statistics (d; maj) is shown to be equidistributed with the pair (; den), where den is Denert's statistic and is an alternative deenition of excedance. A result of Stanley, relating the number of permutations with k descents to the volume of a certain \slice" of the unit d{cube, is also generalized.
منابع مشابه
F-Permutations induce Some Graphs and Matrices
In this paper, by using the notion of fuzzy subsets, the concept of F-permutation is introduced. Then by applying this notion the concepts of presentation of an F-polygroup, graph of an F-permutation and F-permutation matrices are investigated.
متن کاملPermutation tableaux and permutation patterns
Lauren Williams (joint work with Einar Steingrímsson) We introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguished subset of the " Le-diagrams " of Alex Postnikov. The structure of these tableaux is in some ways more transparent than the structure of permutations; therefore we believe tha...
متن کاملRefining Enumeration Schemes to Count According to Permutation Statistics
We develop algorithmic tools to compute quickly the distribution of permutation statistics over sets of pattern-avoiding permutations. More specfically, the algorithms are based on enumeration schemes, the permutation statistics are based on the number of occurrences of certain vincular patterns, and the permutations avoid sets of vincular patterns. We prove that whenever a finite enumeration s...
متن کاملMesh Patterns and the Expansion of Permutation Statistics as Sums of Permutation Patterns
Any permutation statistic f : S → C may be represented uniquely as a, possibly infinite, linear combination of (classical) permutation patterns: f = Στλf (τ)τ . To provide explicit expansions for certain statistics, we introduce a new type of permutation patterns that we call mesh patterns. Intuitively, an occurrence of the mesh pattern p = (π,R) is an occurrence of the permutation pattern π wi...
متن کاملSome equidistributioned statistics on Genocchi permutations
A Genocchi permutation of 2n] is a permutation such that (2i?1) > 2i?1; (2i) 2i for all i 2 f1; 2; : : : ; 2ng. The purpose of this paper is to investigate the equidistribution of several bivariate statistics on the Genocchi permutations.
متن کاملCombinatorial Properties of Permutation Tableaux
Abstract. We give another construction of a permutation tableau from its corresponding permutation and construct a permutation-preserving bijection between 1-hinge and 0-hinge tableaux. We also consider certain alignment and crossing statistics on permutation tableaux that are known to be equidistributed via a complicated map to permutations that translates those to occurrences of certain patte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 15 شماره
صفحات -
تاریخ انتشار 1994